Restricted centrosymmetric permutations
نویسندگان
چکیده
We characterize the sets of centrosymmetric permutations, namely, permutations σ ∈ Sn such that σ(i)+σ(n+1−i) = n+1, that avoid any given family of patterns of length 3. We exhibit bijections between some sets of restricted centrosymmetric permutations and sets of classical combinatorial objects, such as Dyck prefixes and subsets of [n] containing no consecutive integers.
منابع مشابه
Restricted Permutations from Catalan to Fine and Back
We give some history and recent results in the area of pattern restricted permutations. We also present a new bijection between certain pattern restricted permutations.
متن کاملPattern Count on Multiply Restricted Permutations
Previous work has studied the pattern count on singly restricted permutations. In this work, we focus on patterns of length 3 in multiply restricted permutations, especially for double and triple pattern-avoiding permutations. We derive explicit formulae or generating functions for various occurrences of length 3 patterns on multiply restricted permutations, as well as some combinatorial interp...
متن کاملSimple permutations and pattern restricted permutations
A simple permutation is one that does not map any non-trivial interval onto an interval. It is shown that, if the number of simple permutations in a pattern restricted class of permutations is finite, the class has an algebraic generating function and is defined by a finite set of restrictions. Some partial results on classes with an infinite number of simple permutations are given. Examples of...
متن کاملRestricted signed permutations counted by the Schröder numbers
Gire, West, and Kremer have found ten classes of restricted permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. In this paper we enumerate eleven classes of restricted signed permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. We obtain five of these enumerations by elementary methods, five by displayi...
متن کاملTwo Descent Statistics over 321-Avoiding Centrosymmetric Involutions
Centrosymmetric involutions in the symmetric group S2n are permutations π such that π = π−1 and π(i) + π(2n + 1 − i) = 2n + 1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the distribution of some natural descent statistics on 321-avoiding centrosymmetric involutions, including the number of descents in the first half of the involution, and the ...
متن کامل